منابع مشابه
A connection between Similarity Logic Programming and Gödel Modal Logic
In this paper we relate two logical similarity-based approaches to approximate reasoning. One approach extends the framework of (propositional) classical logic programming by introducing a similarity relation in the alphabet of the language that allows for an extended unification procedure. The second approach is a many-valued modal logic approach where 3p is understood as approximately p. Here...
متن کاملBi-modal Gödel logic over [0,1]-valued Kripke frames
We consider the Gödel bi-modal logic determined by fuzzy Kripke models where both the propositions and the accessibility relation are infinitely valued over the standard Gödel algebra [0,1] and prove strong completeness of Fischer Servi intuitionistic modal logic IK plus the prelinearity axiom with respect to this semantics. We axiomatize also the bi-modal analogues of T, S4, and S5 obtained by...
متن کاملGödel Negation Makes Unwitnessed Consistency Crisp
Ontology consistency has been shown to be undecidable for a wide variety of fairly inexpressive fuzzy Description Logics (DLs). In particular, for any t-norm “starting with” the Lukasiewicz t-norm, consistency of crisp ontologies (w.r.t. witnessed models) is undecidable in any fuzzy DL with conjunction, existential restrictions, and (residual) negation. In this paper we show that for any t-norm...
متن کاملOn Modal µ -Calculus and Gödel-Löb Logic
We show that the modal μ-calculus over GL collapses to the modal fragment by showing that the fixpoint formula is reached after two iterations and answer to a question posed by van Benthem in [vBe06]. Further, we introduce the modal μ∼-calculus by allowing fixpoint constructors for any formula where the fixpoint variable appears guarded but not necessarily positive and show that this calculus o...
متن کاملGödel Homomorphisms as Gödel Modal Operators
We extend propositional Gödel logic by a unary modal operator, which we interpret as 5 Gödel homomorphisms, i.e. functions [0, 1] → [0, 1] that distribute over the interpretations of the 6 binary connectives of Gödel logic. We show that validity in the propositional fragment has a simple 7 superintuitionistic Hilbert-type proof system, which is not structurally complete, and that validity 8 doe...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Studia Logica
سال: 2020
ISSN: 0039-3215,1572-8730
DOI: 10.1007/s11225-020-09910-5